Finitary set endofunctors are alg-universal
نویسندگان
چکیده
A category is said to be alg-universal, if every category of universal algebras can be fully embedded into it. We prove here that the category of finitary endofunctors of the category Set is alg-universal. We also present an example of a proper class of accessible set functors with no natural transformations between them (except the obvious identities).
منابع مشابه
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L ∗ of the limit L of the first ω terms in the final sequence. L∗ is the set of points in L which arise from all coalgebras using their canonical morphisms into L, and it was used earlier for different purposes in Kurz and Pattinson [5]. Viglizzo in [11...
متن کاملFree Iterative Theories: A Coalgebraic View
Iterative algebraic theories were introduced by Calvin C. Elgot in Elgot (1975) as a concept serving the study of computation (on, say, Turing machines) at a level abstracting from the nature of external memory. The main example presented by Elgot is the theory of rational trees, that is, infinite trees that are solutions of systems of finitary iterative equations. Or, equivalently, that posses...
متن کاملTheories
We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf (Set)-enriched category theory, where Endf (Set) is the category of finitary endofunctors of Set. We identify finitary monads with one-object Endf (Set)-categories, and ordinary categories admitting finite powers (i.e., n-fold products of each object with itself) with Endf (Set)-categories ad...
متن کاملOn Finitary Functors and Their Presentations
Finitary endofunctors of locally presentable categories are proved to have equational presentations. Special attention is paid to the Hausdorff functor of non-empty compact subsets of a complete metric space.
متن کاملRecursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad CH “generated” by solutions of recursive...
متن کامل